#define _CRT_SECURE_NO_WARNINGS 1
class Solution {
public:
    int longestOnes(vector<int>& nums, int k)
    {
        int n = nums.size();
        int count = 0;
        int len = 0;
        for (int left = 0, right = 0; right < n; right++)
        {
            if (nums[right] == 0) count++;
            while (count > k)
            {
                if (nums[left++] == 0) count--;
            }
            len = max(len, right - left + 1);
        }
        return len;
    }
};